The Medusa algorithm for polynomial matings

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Multiple equivalent matings with the aeroplane polynomial

We produce arbitrarily large equivalence classes of matings with the aeroplane polynomial. These are obtained by a slight generalisation of the technique of proof of a similar result for Wittner captures.

Polynomial Algorithm for

A Polynomial Algorithm For

A polynomial algorithm is proposed for two scheduling problems for which the complexity status was open. A set of jobs with unit processing times, release dates and outtree precedence relations has to be processed on parallel identical machines such that the total completion time ∑ Cj is minimized. It is shown that the problem can be solved in O(n2) time if no preemption is allowed. Furthermore...

Dedicated to the memory of Adrien Douady MULTIPLE EQUIVALENT MATINGS WITH THE AEROPLANE POLYNOMIAL

We produce arbitrarily large equivalence classes of matings with the aeroplane polynomial. These are obtained by a slight generalisation of the technique of proof of a similar result for Wittner captures.